Fast Multiplication and Its Applicationsdaniel
نویسنده
چکیده
FAST MULTIPLICATION AND ITS APPLICATIONS DANIEL J. BERNSTEIN Abstra t. This survey explains how some useful arithmeti operations an be sped up from quadrati time to essentially linear time. x2. Produ t: the FFT ase x13. Sum of fra tions x3. Produ t: extension x11. Matrix produ t x14. Fra tion from ontinued fra tion x4. Produ t: zero-padding and lo alization 55 k k k k k k k k k k k k k x12. Produ t tree :: u u u u u u u u u u u u u u u u u u u u u u u u u u
منابع مشابه
Fast Truncated Multiplication and its Applications in Cryptography
Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 long integers. We review a few truncated multiplication algorithms and adapt them to integers. They are a constant times faster than n-digit full multiplications of time complexity O(n), with 1< α ≤ 2, important in cryptography. For example, the least significant half products with ...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملDesign of a Multiplier for Similar Base Numbers Without Converting Base Using a Data Oriented Memory
One the challenging in hardware performance is to designing a high speed calculating unit. The higher of calculations speeds in a computer system will be pointed out in terms of performance. As a result, designing a high speed calculating unit is of utmost importance. In this paper, we start design whit this knowledge that one multiplier made of several adder and one divider made of several su...
متن کاملFast multiplication and its applications
This survey explains how some useful arithmetic operations can be sped up from quadratic time to essentially linear time.
متن کاملRecursion removal in fast matrix multiplication
Recursion’s removal improves the efficiency of recursive algorithms, especially algorithms with large formal parameters, such as fast matrix multiplication algorithms. In this article, a general method of breaking recursions in fast matrix multiplication algorithms is introduced, which is generalized from recursions removal of a specific fast matrix multiplication algorithm of Winograd.
متن کامل